The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The Fitch paradox poses a serious challenge for anti-realism. This paper investigates the option for an anti-realist to answer the challenge by restricting the knowability principle. Based on a critical discussion of Dummett’s and Tennant’s suggestions for a restriction desiderata for a principled solution are developed. In the second part of the paper a different restriction is proposed. The proposal...
Inspired by some logical considerations, the paper proposes a novel perspective on the use of two-players zero-sum games in abstract argumentation. The paper first introduces a second-order modal logic, within which all main Dung-style semantics are shown to be formalizable, and then studies the model checking game of this logic. The model checking game is then used to provide a systematic game theoretic...
In this paper, I analyse a finding by Riggs and colleagues that there is a close connection between people’s ability to reason with counterfactual conditionals and their capacity to attribute false beliefs to others. The result indicates that both processes may be governed by one cognitive mechanism, though false belief attribution seems to be slightly more cognitively demanding. Given that the common...
I outline four competing probabilistic accounts of contrastive evidential support and consider various considerations that might help arbitrate between these. The upshot of the discussion is that the so-called ‘Law of Likelihood’ is to be preferred to any of the alternatives considered.
While dynamic epistemic logics with common knowledge have been extensively studied, dynamic epistemic logics with distributed knowledge have so far received far less attention. In this paper we study extensions of public announcement logic ( $$\mathcal{PAL }$$ ) with distributed knowledge, in particular their expressivity, axiomatisations and complexity. $$\mathcal{PAL }$$ extended only with...
The article studies properties of interchangeability of pure, mixed, strict, and strict mixed Nash equilibria. The main result is a sound and complete axiomatic system that describes properties of interchangeability in all four settings. It has been previously shown that the same axiomatic system also describes properties of independence in probability theory, nondeducibility in information flow,...
In the literature, different axiomatizations of Public Announcement Logic (PAL) have been proposed. Most of these axiomatizations share a “core set” of the so-called “reduction axioms”. In this paper, by designing non-standard Kripke semantics for the language of PAL, we show that the proof system based on this core set of axioms does not completely axiomatize PAL without additional axioms and rules...
Comparative concepts such as greener than or higher than are ways of ordering objects. They are fundamental to our grasp of gradable concepts, that is, the type of meanings expressed by gradable general terms, such as “is green” or “is high”, which are embeddable in comparative constructions in natural language. Some comparative concepts seem natural, whereas others seem gerrymandered. The aim of...
Recent experimental evidence from developmental psychology and cognitive neuroscience indicates that humans are equipped with unlearned elementary mathematical skills. However, formal mathematics has properties that cannot be reduced to these elementary cognitive capacities. The question then arises how human beings cognitively deal with more advanced mathematical ideas. This paper draws on the extended...
The subject of this article is Modal-Epistemic Arithmetic (MEA), a theory introduced by Horsten to interpret Epistemic Arithmetic (EA), which in turn was introduced by Shapiro to interpret Heyting Arithmetic. I will show how to interpret MEA in EA such that one can prove that the interpretation of EA is MEA is faithful. Moreover, I will show that one can get rid of a particular Platonist assumption...
According to a much discussed argument, reliabilism is defective for making knowledge too easy to come by. In a recent paper, Weisberg aims to show that this argument relies on a type of reasoning that is rejectable on independent grounds. We argue that the blanket rejection that Weisberg recommends of this type of reasoning is both unwarranted and unwelcome. Drawing on an older discussion in the...
The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic,...
In classical logic, the proposition expressed by a sentence is construed as a set of possible worlds, capturing the informative content of the sentence. However, sentences in natural language are not only used to provide information, but also to request information. Thus, natural language semantics requires a logical framework whose notion of meaning does not only embody informative content, but also...
This article discusses how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. Techniques and ideas from non-standard analysis are brought to bear on the problem.
K-axiom-based epistemic closure for explicit knowledge is rejected for even the most trivial cases of deductive inferential reasoning on account of the fact that the closure axiom does not extend beyond a raw consequence relation. The recognition that deductive inference concerns interaction as much as it concerns consequence allows for perspectives from logics of multi-agent information flow to be...
In what follows, I argue that the semantic approach to scientific theories fails as a means to present the Wright–Fisher formalism (WFF) of population genetics. I offer an account of what population geneticist understand insofar as they understand the WFF, a variation on Lloyd’s view that population genetics can be understood as a family of models of mid-level generality.
Linkage (or genetic) maps are graphs, which are intended to represent the linear ordering of genes on the chromosomes. They are constructed on the basis of statistical data concerning the transmission of genes. The invention of this technique in 1913 was driven by Morgan’s group’s adoption of a set of hypotheses concerning the physical mechanism of heredity. These hypotheses were themselves grounded...
When can macroscopic data about a system be used to set parameters in a microfoundational simulation? We examine the epistemic viability of tweaking parameter values to generate a better fit between the outcome of a simulation and the available observational data. We restrict our focus to microfoundational simulations—those simulations that attempt to replicate the macrobehavior of a target system...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.